Social network message categorization systems and methods

ABSTRACT

Systems and methods of identifying and categorizing social network messages that are relevant to selected categories and text terms are provided. The frequency of text terms appearing in social network messages are calculated for multiple categories. Based on the calculated text term frequency, social network messages can be identified and/or categorized that match a provided set of text terms. Selecting and/or associating text terms and categories are determined by repeatedly analyzing social network messages.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of U.S. application Ser. No. 12/781799 filed May 17, 2010, which claimed the benefit of U.S. Provisional Patent Application No. 61/178,619, filed on May 15, 2009, the disclosure of which is hereby incorporated by reference as if set forth in full herein.

BACKGROUND

The present invention relates to textual classification systems, and in particular, to social network message categorization and identification systems and methods.

The Internet is a tremendous source of information, but finding a desired piece of information has been the preverbal “needle in the haystack”. For example, services like blogs provide data miners a daunting task of perusing through extensive amounts of text in order to find data that can become applicable for other uses. Hence, text data mining and information retrieval systems designed for large collections of lengthy documents have arisen out of the practical need of finding a piece of information in the massive collections of varied documents (such as the World Wide Web) or in databases of professional documents (such as medical or legal documents). Likewise, with the popularity of social networking increasing every day, the amount of user-generated content from these social networking sites continues to grow. Thus, finding information that is relevant and useable is quickly becoming more difficult.

These popular social networking services or options, like Twitter messages or Facebook statuses, are typically much shorter in length than full web pages. This brevity however makes it increasingly difficult to use current filtering techniques specifically designed to sort through large amounts of data. For example, popular techniques, such as term frequency—inverse document frequency (TF-IDF) weighting, are dependent on both the collection of information, as well as the average document size, to be large.

Additionally, in recent years there has been an increase in the number of very short documents, usually in the form of user generated messages or comments. Typical user generated messages have come from a number of sources, for example, instant messaging programs, such as AOL instant messenger; online chat rooms; text messages from mobile phones; message publication services, such as Twitter; and “Status” messages, such as those on Facebook pages. Thus, with the rising popularity of these messaging services, there has become a need to search the messages for their content. Some techniques of searching short messages consist simply of doing regular expression matching. However, these techniques typically fail when a term being searched is ambiguous and/or used in unrelated topics. For example, searching for “Amazon” could result in finding messages about the Amazon river and the online retailer, Amazon. Also, if additional terms are provided, many relevant messages may be omitted. For example, searching for “Amazon river” would not match the message “Hiked to the Amazon today—what a beautiful jungle this is”, whereas a webpage or a large document about the Amazon river would likely contain both the words “Amazon” and “river”, while a short message may not.

Accordingly, there is a need to provide messaging categorization systems and methods to identify relevant social network messages while overcoming the obstacles and shortcomings previously noted and recognized in the art.

SUMMARY

Generally, systems and methods of identifying and categorizing messages that are relevant to selected categories and terms are provided.

In one embodiment, a method of textual categorization of social network messages is provided. The method comprises scoring one or more messages from one or more social network messaging services based on one or more text terms for a determined category by a message server; matching the one or more scored messages to one or more text terms from a query; and returning one or more messages having a final score that equals or exceeds a threshold value for the determined category, the final score being based on scores of the scored messages and match values of the matched messages. The messages in one embodiment are scored based on text term frequency calculations associated with the one or more text terms.

The above-mentioned and other features of this invention and the manner of obtaining and using them will become more apparent, and will be best understood, by reference to the following description, taken in conjunction with the accompanying drawings. The drawings depict only typical embodiments of the invention and do not therefore limit its scope.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating a messaging classification and retrieval system in accordance with various embodiments of the invention.

FIG. 2 is a flowchart illustrating a messaging classification generation process in accordance with various embodiments of the invention.

FIG. 3 is a flowchart illustrating a messaging classification retrieval process in accordance with various embodiments of the invention.

FIG. 4 is a flowchart illustrating a messaging categorization process in accordance with various embodiments of the invention.

DETAILED DESCRIPTION

Generally, a message categorization system is provided in which categories are set up with associated keywords in which short or social network messages are identified and placed in an appropriate category. In various embodiments, categories are subject or topic containers that include, but are not limited, to a person, place or thing. Keywords extracted from short messages that are relevant to a category are associated with the corresponding category. For every message a score is assigned to the message for each category. In one embodiment, a query for information on a specific topic can identify the best message or messages by identifying the appropriate category and utilizing the best scored messages for the identified category in conjunction with an amount of keywords that match between the message and the query.

Categories and Keywords

Categories of interest are generated by identifying a specific subject or topic, such as a person, place or an object. The categories in one embodiment are refined based on usage performance. In particular, categories focused on things perform well with narrower descriptions having a better performance. For example, a category such as “sports” would not perform as well as “basketball”, which would not perform as well as “UCLA basketball”. These fine grained categories however can come at the cost of increased processing time and storage. In one embodiment, each category is unique having no overlap with other categories.

For each category generated, one or more keywords or text terms are identified and associated with each category. In one embodiment, keywords are stored in tables in which each category may have multiple tables. The keywords that are stored come from messages in the desired medium. As such, in one embodiment, within each category, there is a specific table with one or more specific keywords for each medium. Each medium, e.g., messaging service, can have different message formats and/or terminology used. For example, text messages from a mobile phone can and will often look quite different from messages posted to Facebook. Thus, keywords from other sources in one embodiment are only used as a query into the desired message format. In this way the keyword tables would account for slang terms and other such differentiators specific to the medium. One or more of the following processes can be used to identify the keywords.

Unambiguous Training

For a given category, e.g., musical artists, there can be ambiguous and unambiguous terminology. For example, an artist name can be ambiguous (“No Doubt”) or unambiguous (“Metallica”). Utilizing unambiguous terminology, every keyword used in a message containing “Metallica” would be stored, and the usage frequencies of the keywords would be used as a measure of how related to the musical artist category a given query would be.

User Tagging

A message database in one embodiment would allow for manual tagging of information. These tags are created by users as a means to self-classify messages. One example is preceding a tag name with a unique character, e.g., a “#” character. For example, if a message contains “#oscars”, then presumably the message is about the Oscars awards ceremony. As such, keywords about the Oscars awards ceremony can be generated by finding every message with the “#oscars” tag, and store each of the keywords present in the located messages. The resulting table would thus include words commonly used to describe the ceremony, and thus using the table a message that did not have a “#oscars” tag could still be located.

Third-Party Information

In one embodiment, a third party database or similar resource can be used to identify keywords. For example, utilizing a resource, such as Wikipedia, as a large collection of words related to a category, a TF-IDF analysis of this resource would yield the most important keywords for a given category. Messages could be searched to locate messages that used these keywords in which each of the resulting message-based keywords are stored in the associated category's table.

Category and Message Scoring

A message score for a given category is a measure of how likely its keywords are present in all the messages related to the category. The message scores are defined by

${{score}\left( {m,c} \right)} = {\sum\limits_{g \in m}{f\left( {P\left( {g,c} \right)} \right)}}$

where m is a given message, c is a given category, g is a keyword in the message, and P(g,c) is the normalized frequency of a message in category c containing the keyword g. The function f is a thresholding or quantization function.

Quantization Function f

Most category tables have probability distributions that follow a power-law distribution. However, the resulting tables may have a large number of small values, or conversely, a small number of large values. In such cases it may be helpful to pass this table through a quantization function. The simplest function is simply a threshold, by which any keywords that do not pass the threshold have frequencies set to 0. More complex quantizers are used to simplify the table, boost certain values, or otherwise be shaped to improve the scoring performance.

A final message score is defined as w_(score)“score(m,c_(q))+w_(match)”match(m,q), where w is a weight [0 . . . 1], score(m,c_(q)) is the score of the message in the query's category, and match(m,q) is the percentage of keywords that match between message m and the query q. This value is used to ensure that the messages have some similarity, even if they both score high in each category. In one embodiment, the final message score can be defined as score(m,c_(q)) which can be useful to obtain all relevant messages in a query's category and/or based on a threshold value or score. The inclusion of weight w_(score) and/or w_(match) can be used to further refine these messages to provide messages that more closely match the query.

Referring now to an example, if the query is “Amazon river”, then this query would rank high in a category about rivers, the Amazon jungle, or even geographical categories. This query however would score lower in categories about companies, as the term “river” would not occur very frequently in these categories. Similarly, the message “Hiked to the Amazon today—what a beautiful jungle this is” would also rank high in the category of geographical messages, as the keywords “hiked” and “jungle” would appear often in such categories. Finally, the message matches 50% of the terms in the query (i.e., “Amazon”), ensuring that the message has a relation to the query and not just the category as a whole.

Referring now to drawings, a message categorization system is shown in FIG. 1. The system includes a message server 3 that is coupled with a message database 5 and is in network communication with a plurality of messaging services and information sources 7. The message server receives user generated messages from the plurality of messaging services and information sources. The received messages are stored in category records in the message database and keywords are selected from the received messages and associated with the category records. The message server also scores each message which is stored in the message database and associated with the corresponding category records.

The message server 3 also receives queries externally from, for example, messaging services or web servers or internally, for example, through a user interface in communication with the message server. For each received query, the message server calculates a score that identifies a specific category. Utilizing the score, the server retrieves the associated category record from the message database. Messages stored or associated with the category record is retrieved by the server and transmitted back to a designated recipient, e.g., the sender of the query or search request. In one embodiment, the message server calculates or retrieves a final message score for the identified category for the stored messages. Utilizing the final message score, the server selects specific messages stored or associated with the category record for transmission to a designated recipient.

In FIG. 2, a messaging classification generation process in accordance with various embodiments of the invention is illustrated. Initially, categories are first determined (21). Keywords are identified and used to populate tables for each determined category (22). In one embodiment, a medium is identified and used to select tables in which to populate with the keywords identified. Each message received is scored for each determined category (23).

Referring now to FIG. 3, a messaging classification retrieval process starts with a query request being received (31). The request is scored for each category (32) and the category with the highest query score is selected (33). Messages with the highest score in this category and that contain some of the matched terms are returned as the message results (34). In one embodiment, terms or words are extracted from the query and matched to keywords for the determined category.

Referring back to the “Amazon river” query example, two potential categories are established. It would be appreciated that the number of categories may be varied and numerous along with the associated keywords and messages, but are shown here in a limited fashion to facilitate the description of the invention. The first category is a geographical location category and the second category is a company category. As shown in the following tables, each category includes a set of keywords with associated normalized keyword frequency calculations.

TABLE 1 Geographical Location Normalized Keyword Frequency Keywords 0.2  river . . . . . . 0.05 jungle 0.05 Amazon  0.005 hike

TABLE 2 Company Normalized Keyword Frequency Keywords 0.5   revenue 0.2   employee 0.01  Amazon . . . . . . 0.0005 jungle 0.0001 hike

Utilizing the tables and in particular matching the keywords of each category with the terms in the query, a query score is determined utilizing the associated normalized keyword frequency calculations. For example, the query score for the geographical location category is 0.25 (0.2 (river)+0.05 (Amazon)). Likewise, the query score for the company category is 0.01 (0.01 (Amazon)+0 (river)).

Given a first message, “Hiked to the Amazon today, what a beautiful jungle this is” and a second message, “Amazon announced revenue up 38%”, messages scores can also be generated by matching keywords for each category and utilizing the associated normalized keyword frequency calculations. For example, the message score for the first message in the geographical category is 0.105 (0.05 (jungle)+0.05 (Amazon)+0.005 (hike)) and in the company category is 0.0106 (0.01 (Amazon)+0.0005 (jungle)+0.0001 (hike)). The second message score for the geographical category is 0.05 (Amazon) and for the company category 0.51 (0.5 (revenue)+0.01 (Amazon)).

Since the query score for the geographic category (0.25) is higher or larger than the query score for the company category (0.1), the geographic location category is selected to utilized the message scores for each of the messages. Thus, score (m1, geographic)=0.105 and score (m2, geographic)=0.05, where m1 and m2 are respective first and second messages. Since in the provided example, the search query is short, only one term matches, i.e., Amazon. Thus, the match values for each message are match(m1, q)=0.5 and match(m2, q)=0.5, where q is the query. Accordingly, the final score disregarding weight factors shows that the first message has a final score of 0.605 (0.105+0.5) greater than the final score of 0.55 (0.05+0.5) for the second message. Thus, the first message being the most relevant is provided as the search result for the given search query. In one embodiment, the match value is zeroed or ignored which can be useful to provide all messages limited only by, for example, a score at or above a particular threshold score as the search results for the given query.

Referring now to FIG. 4, a detailed social network categorization process is provided in which categories are built that describe or encompass a particular topic (41). In various embodiments, the categories are built by user interaction and/or via Internet category services in which one or more words or phrases are tabulated or associated with one or more categories. The categories that are distinct and/or entirely contained within another category are utilized that particularly encompass a topic. Generally, a union of categories represent messages of interest that relate to a general overall topic and thus minimization of intersections of such categories are desired to capture or build categories that are distinct to uniquely encompass a particular topic.

Text terms that include key words or phrases of key words are then identified to be associated with the built categories (42). The text terms that do not have another meaning relevant to another category are desired. In one embodiment, text terms are identified by tagging of particular words or phrases via user interaction, database services and/or a combination thereof. In various embodiments, the text terms are identified by the results of a query to match a plurality of messages from a social network messaging service and/or a document or associated document via a URL (uniform resource locator). The text terms can also include the query itself or parts thereof.

The identified text terms are ambiguity tested (43). In one embodiment, one or more text terms are compared to one or more lists of terms previously identified as ambiguous or unambiguous. The list of terms for comparison in one embodiment are provided by Internet database services, user interaction, a previously generated list or is set by the message server. Text terms that are identified as ambiguous are marked accordingly.

If the text terms are identified as unambiguous, the determination of which category the text terms should be associated is performed (44). The text terms in one embodiment are used as a category query to return category results that match the text terms or other terms that are associated with a particular category that match the text terms. In various embodiments, a category query is performed utilizing a predetermined or provided document, webpage or links thereto using TF-IDF cosine similarity and/or a public index of web pages (e.g. DMOZ (Yahoo)).

Based on the results of the category query, the determined categories (41) are refined. In one embodiment, the categories are mapped via user interaction and/or an iterative refinement mapping of each category based on the initially determined category and the category results. Additional categories or sub-categories can also be determined based on such mapped categories. Further refinements to such mapping or text terms can also be performed to remove text terms that do not relate to the determined categories (e.g., a quality assurance action). Logging of such undesired text terms can also assist in further refinements of the mapping and/or determination of the categories.

In one embodiment, the initial lists or text terms for each category table or map are refined or replaced that may also include additional or replacement categories. The initial lists and categories allows the system or server to respond to initial requests or queries and also enables the refinement and growth of the unique text terms and categories. Refinements of terms and categories can also occur by aging the oldest terms or categories or other similar progressive processes that assists in refining the terms and the categories.

The text terms are applied to one or social networks to generate results that identify each text term in one or more messages (45). Stemming, stop words and/or other processes are utilized that assist in expanding or varying the text terms to enhance the generated results to match the text terms to the messages. Stemming for example can include all forms of a text term (e.g., plural, tense, etc.) and stop words, for example, the, and, along with special characters, usernames, codes (e.g., URLs), common names or defined list of special words can also be ignored or removed. In various embodiments, generally text terms that are at least three characters and that are not stop or special words are utilized. Slang, abbreviations or misspelled terms in one embodiment are also used and can be useful for capturing evolving technology and associated terminology as it progresses or changes over time.

The number of occurrences of each text term identified in the one or more messages is quantified (46). In one embodiment, each occurrence is counted or scored such that for each category there is a running count for the text terms that have occurred in the message/search results for that category or topic. A separate or cumulative count can also be maintained for stemming terms. Based on the counts or totals, an ordered list of text terms that relate to a topic can be generated and thus in one embodiment, for each category the text terms are sorted by the counts for the text terms.

The quantified occurrences of each text term for each category are attenuated (47). Attenuation seeks to find or refine the terms that are uniquely indicative/associated with a category. In one embodiment, for every word and the position, count or score in all the categories are examined and the count for a given term based upon the number of topics in which the term scores highly is attenuated. In various embodiments, fractions of its count are taken relative to the occurrences in each topic in which the term scored high (e.g., top 10, top 10%) relative to a scaling factor.

The attenuated keyword (NoT′) in one embodiment is based on the following:

NoT′=NoT−NoT(¾)(NuT/MxNut)

where:

TT=list of keywords and corresponding topics (e.g. [(“time”,[1,3,17]),(“love”,[4,5]),(“great”,[1,2,4,10,25]), . . .]);

NoT=number of times keyword K in TT appears in topic T;

NuT=number of topics in which K appears in top 10%; and

MxNuT=number of topics for keyword with max NuT in TT.

The attenuated occurrences of each text term for each category are normalized (48). For example, the counts are modified to a range of zero to one with one being identified as a text term that is uniquely associated with a category. Normalization of the text terms allows a comparison of the terms across multiple topics or categories. The normalization of text terms has been previously described in greater detail above.

Therefore, utilizing the categorization process and given a social network message or a string of text terms, the messages may be filtered and/or parsed to identify a set of key words that are scored against all or a set of identified categories. The score of each word for each category is identified and averaged to determine the score of each word per category for the key words from the initial message or text terms. An average of scores prevents longer phrases or text terms providing a higher score than shorter phrases that may result in inaccurate categorization or score of each word. The score per category can thus be provided to a requester or an interested application in various forms. Some non-limiting examples include a list of text terms and relative scores, a list of text terms that exceed a “high” score threshold, a list of categories in which the terms have or exceed a particular score and/or a combination thereof.

Queries and/or updates to the category tables can be performed relatively infrequently. However, as a text term definition changes for example the category tables can be updated. For example, a primarily music performer may also become an actor and thus the category tables may need to be updated to reflect that a text term associated with the music performer for a music category may also be associated with a movie category. Searching on social networks and quantifying text term occurrences can also be done more frequently, e.g., weekly. As such, this may pick up on slang and other trendy or newsworthy updates that are occurring or evolving. Some non-limiting examples include terms that weren't associated with music that are now being associated with music, the term “super” not associated with football normally but become associated in the leading up to occurrence of the “Super Bowl”, and so forth.

In one particular example, a webpage advertising a movie is provided. By utilizing the context of the movie being advertized and key words associated with the context or category of the movie, social network messages can be retrieved that match the associated key words such that these messages are displayed on the webpage advertising the movie. As a result, one viewing the webpage advertisement is also exposed to messages or information provided by other users, e.g., not the advertiser, timely and particularly relevant to the advertised movie.

In another particular example, a text box widget or other similar user interface is provided to receive an input of text terms. A category can also be selectable, provided or predefined. Messages relevant to the text terms or related text terms are returned or are accessible by another application or system able to display or otherwise utilize such messages as a search result, aggregate of relevant messages and so on. The messages can also be limited or refined by utilizing other criteria such as time, location, a user or source and the like. In other examples, the identified text terms can be used to automatically provide or populate messages with metadata, tags or other similar associations to categorize messages to enhance the identification and/or retrieval of such messages.

Similarly, an aggregate of messages based on a single condition or category, e.g., belonging to a particular user, can be further categorized based on a set of text terms for one or more categories. As a result, one or more subsets of messages can be provided or identified that relate to a particular category, e.g., movies, music, football, etc., thereby creating multiple messages feeds from a single user or a single source without interaction by the user or source. Accordingly, different message feeds could be retrieved or transmitted to different applications or servers that relevant or useful for the particular application or server.

The system in one embodiment is provided one or more text terms that may have different meanings and without context. The system identifies a potential meaning within a particular context. The meaning and context of the term can then be applied to or received by various other applications or systems to identify and/or build or transmit one or more social network messages. Similarly, such other applications or systems can remove unintended (mistaken) or malicious messages by ignoring or removing social network messages that do not relate to the determined meaning and context of the text terms. In one embodiment, the social network messages include but are not limited to messages having up to 140 characters.

Although the present invention has been described in certain specific aspects, many additional modifications and variations would be apparent to those skilled in the art. It is therefore to be understood that the present invention may be practiced otherwise than specifically described, including various changes in the size, shape and materials, without departing from the scope and spirit of the present invention. Thus, embodiments of the present invention should be considered in all respects as illustrative and not restrictive. 

1. A method of textual categorization of social network messages, the method comprising: scoring one or more messages from one or more social network messaging services based on one or more text terms for a determined category by a message server, where a category comprises a set of keywords and a set of associated normalized keyword frequency calculations associated with the set of keywords; matching the one or more scored messages to one or more text terms from a query; and returning one or more messages having a final score that equals or exceeds a threshold value for the determined category, the final score being based on scores of the scored messages and match values of the matched messages.
 2. The method of claim 1 further comprising scoring the query based on one or more text terms associated with one or more categories by the message server to identify the determined category.
 3. The method of claim 1 further comprising retrieving the one or more text terms associated with one or more categories from a message database.
 4. The method of claim 1 wherein the text terms are unambiguous text terms.
 5. The method of claim 4 further comprising testing ambiguity of a text term to generate unambiguous text terms.
 6. The method of claim 4 further comprising matching text terms to a text database to generate unambiguous text terms.
 7. The method of claim 4 further comprising establishing one or more categories by the message server through matching text terms to a category database.
 8. The method of claim 7 further comprising associating the unambiguous text terms to the established categories by the message server.
 9. The method of claim 8 further comprising adding or removing one or more text terms to the established categories.
 10. The method of claim 1 wherein scoring one or more messages is based on text term frequency calculations associated with the one or more text terms.
 11. The method of claim 10 further comprising counting a number of occurrences of a text term relative to a plurality of messages from one or more social messaging services to determine the text term frequency calculations for the text term.
 12. The method of claim 11 further comprising attenuating the counts for the one or more text terms.
 13. The method of claim 12 further comprising normalizing the attenuated counts for the one or more text terms.
 14. The method of claim 12 further comprising adjusting the text term frequency calculations.
 15. The method of claim 14 wherein adjusting the text term frequency calculations further comprises repeatedly counting a number of occurrences of a text term relative to a plurality of messages from one or more social messaging services.
 16. A message categorizer, comprising: memory configured to store a textual categorization application and one or more messages; and a processor; wherein the textual categorization application configures the processor to: score one or more messages from one or more social network messaging services based on one or more text terms for a determined category, where a category comprises a set of keywords and a set of associated normalized keyword frequency calculations associated with the set of keywords; match the one or more scored messages to one or more text terms from a query; and return one or more messages having a final score that equals or exceeds a threshold value for the determined category, the final score being based on scores of the scored messages and match values of the matched messages.
 17. The message categorizer of claim 16, wherein the textual categorization application further configures the processor to score the query based on one or more text terms associated with one or more categories to identify the determined category.
 18. The message categorizer of claim 16, wherein the textual categorization application further configures the processor to retrieve the one or more text terms associated with one or more categories from a message database.
 19. The message categorizer of claim 16, wherein the textual categorization application further configures the processor to test the ambiguity of a text term to generate unambiguous text terms.
 20. The message categorizer of claim 16, wherein the textual categorization application further configures the processor to score one or more messages based on text term frequency calculations associated with the one or more text terms. 